A surprisingly simple de Bruijn sequence construction
نویسندگان
چکیده
منابع مشابه
A surprisingly simple de Bruijn sequence construction
Pick any length n binary string b1b2 · · · bn and remove the first bit b1. If b2b3 · · · bn1 is a necklace then append the complement of b1 to the end of the remaining string; otherwise append b1. By repeating this process, eventually all 2 binary strings will be visited cyclically. This shift rule leads to a new de Bruijn sequence construction that can be generated in O(1)-amortized time per b...
متن کاملMulti-Shift de Bruijn Sequence
A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to a multi-shift setting: a m-shift de Bruijn sequence of order n is a word such that every word of length n appears exactly once in w as a factor that starts at an index im+ 1 for some integer i ≥ 0. We show the number of th...
متن کاملMemory Efficient De Bruijn Graph Construction
Massively parallel DNA sequencing technologies are revolutionizing genomics research. Billions of short reads generated at low costs can be assembled for reconstructing the whole genomes. Unfortunately, the large memory footprint of the existing de novo assembly algorithms makes it challenging to get the assembly done for higher eukaryotes like mammals. In this work, we investigate the memory i...
متن کاملA Simple Combinatorial Algorithm for de Bruijn Sequences
This note presents a combinatorial method to construct a De Bruijn cycle for any order n.
متن کاملA simple shift rule for k-ary de Bruijn sequences
A k-ary de Bruijn sequence of order n is a cyclic sequence of length k in which each k-ary string of length n appears exactly once as a substring. A shift rule for a de Bruijn sequence of order n is a function that maps each length n substring to the next length n substring in the sequence. We present the first known shift rule for k-ary de Bruijn sequences that runs in O(1)-amortized time per ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.08.002